Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a) → x
f(x, g(y)) → f(g(x), y)

Q is empty.


QTRS
  ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a) → x
f(x, g(y)) → f(g(x), y)

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, a) → x
f(x, g(y)) → f(g(x), y)

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

f(x, a) → x
Used ordering:
Polynomial interpretation [25]:

POL(a) = 0   
POL(f(x1, x2)) = 2 + x1 + x2   
POL(g(x1)) = x1   




↳ QTRS
  ↳ RRRPoloQTRSProof
QTRS
      ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, g(y)) → f(g(x), y)

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, g(y)) → f(g(x), y)

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

f(x, g(y)) → f(g(x), y)
Used ordering:
Polynomial interpretation [25]:

POL(f(x1, x2)) = x1 + 2·x2   
POL(g(x1)) = 2 + x1   




↳ QTRS
  ↳ RRRPoloQTRSProof
    ↳ QTRS
      ↳ RRRPoloQTRSProof
QTRS
          ↳ RisEmptyProof

Q restricted rewrite system:
R is empty.
Q is empty.

The TRS R is empty. Hence, termination is trivially proven.